Feature-Based TAG in place of multi-component adjunction: Computational Implications

نویسندگان

  • Beth Ann Hockey
  • Srinivas Bangalore
چکیده

Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions using an existing uniication-based Earley-style TAG parser, thus obviating the need for a multi-component TAG parser without sacriicing linguistic coverage for English.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree Adjoining Grammar, Semantic Calculi and Labelling Invariants

Recently, proposals have been made to combine Tree Adjoining Grammar (TAG) with either Glue or Flat Semantic Representation Languages. In this paper, we additionally specify the combination of TAG with λ-based semantics and compare the three approaches. We observe several invariants and suggest that semantic construction in TAG is governed by a set of general principles that can be used to faci...

متن کامل

Multiple Adjunction in Feature-Based Tree-Adjoining Grammar

In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG). We provide a recognition algorithm for FB-TAG that suppor...

متن کامل

TAG derivation as monotonic C-command

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the sub-trees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction ...

متن کامل

TAG Derivation as Monotonie C-Command*

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the subtrees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction o...

متن کامل

Tree Adjoining Grammars in a Fragment of the Lambek Calculus

This paper presents a logical formalization of Tree Adjoining Grammar (TAG). TAG deals with lexicalized trees and two operations are available: substitution and adjunction. Adjunction is generally presented as an insertion of one tree inside another, surrounding the subtree at the adjunction node. This seems to contradict standard logical ability. We prove that some logical formalisms, namely a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cmp-lg/9410030  شماره 

صفحات  -

تاریخ انتشار 1994